Transformations between Cryptographic Protocols
نویسنده
چکیده
A transformation F between protocols associates the messages sent and received by participants in a protocol Π1 with messages sent and received in some Π2. Transformations are useful for modeling protocol design, protocol composition, and the services that protocols provide. A protocol transformation determines a map from partial behaviors A1 of Π1—which we call “skeletons”—to skeletons F (A1) ofΠ2. Good transformations should act as functors, preserving homomorphisms (informationpreserving maps) from one Π1-skeleton to another. Thus, if H : A1 7→ A2 is a homomorphism between Π1-skeletons, then there should be a homomorphism F (H) : F (A1) 7→ F (A2) between their images in Π2. We illustrate protocol transformation by examples, and show that our definition ensures that transformations act as functors.
منابع مشابه
A Calculus for Secure Channel Establishment in Open Networks
This paper presents a calculus of channel security properties which allows to analyze and compare protocols for establishing secure channels in an insecure open network at a high level of abstraction. A channel is characterized by its direction, time of availability and its security properties. Cryptographic primitives and trust relations are interpreted as transformations for channel security ...
متن کاملAttack-preserving Security Protocol Transformations
The rigorous incremental development of security protocols has so far received much less attention than protocol verification techniques. In this work, we study security protocol transformations. These can serve both for simplifying protocols before verification and, in the other direction, for developing protocols by stepwise refinement of simple abstract protocols into complex concrete ones. ...
متن کاملC∅C∅: A Framework for Building Composable Zero-Knowledge Proofs
Non-interactive zero-knowledge proofs are a powerful cryptographic primitive used in privacypreserving protocols. We design and build C∅C∅, the first system enabling developers to build efficient, composable, non-interactive zero-knowledge proofs for generic, user-defined statements. C∅C∅ extends state-of-the-art SNARK constructions by applying known strengthening transformations to yield UC-co...
متن کاملMethodical Use of Cryptographic Transformations in Authentication Protocols
Design of cryptographic protocols for authentication and key management is well known to be a diicult problem. While much research has been devoted to analysis techniques, basic design principles remain lacking. In this paper a common method of protocol design is identiied which contributes to protocol problems in a number of ways. This is the practice of encrypting all relevant elds using a re...
متن کاملSound Security Protocol Transformations
We propose a class of protocol transformations, which can be used to (1) develop (families of) security protocols by refinement and (2) abstract existing protocols to increase the efficiency of verification tools. We prove the soundness of these transformations with respect to an expressive security property specification language covering secrecy and authentication properties. Our work clarifi...
متن کامل